package bintree.leetcode;

/**
 * @Author: yuisama
 * @Date: 2021/9/7 11:41
 * @Description:二叉树的最大深度
 * https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/
 */
public class Num104_MaxDepth {
    public int maxDepth(TreeNode root) {
        if (root == null)
            return 0;
        return 1 + Math.max(maxDepth(root.left),maxDepth(root.right));
    }
}
